Measures of Quantum Computing Speedup
نویسندگان
چکیده
SFI Working Papers contain accounts of scienti5ic work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-‐reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant.
منابع مشابه
A New Model Representation for Road Mapping in Emerging Sciences: A Case Study on Roadmap of Quantum Computing
One of the solutions for organizations to succeed in highly competitive markets is to move toward emerging sciences. These areas provide many opportunities, but, if organizations do not meet requirements of emerging sciences, they may fail and eventually, may enter a crisis. In this matter, one of the important requirements is to develop suitable roadmaps in variety fields such as strategic, ca...
متن کاملSpeedup in quantum computation is associated with attenuation of processing probability
Quantum coherence allows the computation of an arbitrary number of distinct computational paths in parallel. Based on quantum parallelism it has been conjectured that exponential or even larger speedups of computations are possible. Here it is shown that, although in principle correct, any speedup is accompanied by an associated attenuation of detection rates. Thus, on the average, no effective...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAn efficient quantum algorithm for generative machine learning
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer [1–3]. Machine learning represents an important field with broad applications where quantum computer may offer significant speedup [4–8]. Several quantum algorithms for discriminative machine learning [9] have been found based on efficient...
متن کاملQuantum circuits for OR and AND of ORs
We give the first quantum circuit for computing f (0) OR f (1) more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, f (0)⊕ f (1)) to give the full set of logical connectives (up to relabelling of inputs and outputs) for which there is quantum speedup.
متن کامل